hmm dbase approach model ant behavior gener model versu discrimin model approach symbol sequenc classif model ant activ mean structur hmm structur hidden markov model gener tool model agent behavior structur hidden markov model gener framework model complex sequenc model tempor behavior structur hidden markov model applic keystrok dynam increment construct structur hidden markov model hierarch hidden markov model user fprocess profil learn machin learn data mine articl focu primarili role machin learn algorithm data mine process medic repres prototyp data mine problem data consist collect time seri descript data learn predict event seri emerg section base earlier event symptom deliveri medic illustr analog learn predict bank loan applic high risk fail repai loan figur shown figur applic data typic consist time seri descript custom bank balanc demograph inform medic symptom applic shown figur includ predict custom purchas behavior custom retent qualiti good produc manufactur line applic data mine successfulli appli practic research promis effect techniqu state art experiment evalu hierarch hidden markov model learn complex event descript abstract learn profil base hierarch hidden markov model learn user profil trace learn regular express noisi sequenc learn complex spars event long sequenc transit de phase apprentissag relationnel un analys critiqu relat learn search critic region machin learn strongli reli cover test assess candid hypothesi cover train exampl present paper investig learn relat concept exampl term relat learn induct logic program investig chanc success comput cost relat learn appear sever affect presenc phase transit cover test aim date relat learner appli wide rang artifici fulli relat learn problem experiment observ phase transit behav attractor relat learn matter region learn problem belong learner produc hypothes ly close phase transit region failur region appear learner fail learn accur hypothesi region surprisingli probabl failur systemat increas size underli target concept circumst longer concept easier accur approxim shorter interpret find propos discuss recogn discov complex event sequenc mont carlo approach hard relat learn problem learn phase transit edg analyz relat learn phase transit framework relat learn scale phase transit relat learn machin learn strongli reli cover test assess candid hypothesi cover train exampl present paper investig learn relat concept exampl term relat learn induct logic program investig chanc success comput cost relat learn appear sever affect presenc phase transit cover test aim date relat learner appli wide rang artifici fulli relat learn problem experiment observ phase transit behav attractor relat learn matter region learn problem belong learner produc hypothes ly close phase transit region failur region appear learner fail learn accur hypothesi region surprisingli probabl failur systemat increas size underli target concept circumst longer concept easier accur approxim shorter interpret find propos discuss relat learn hard problem phase transit misbehaviour back dpropag dnormal rbfn solut experiment studi phase transit match high dperform knowledg extract data pc dbase network workstat automat construct classifi program correctli classifi data collect real world major problem pattern recognit wide area relat artifici intellig includ data mine paper present net distribut algorithm infer classifi pre collect data implement pc base network workstat pc now order effect exploit comput power provid pcnow net incorpor set dynam load distribut techniqu adapt behavior variat comput power due resourc content provid fault toler scheme enabl continu comput major machin unavail execut introduct induct classif rule databas instanc pre classifi teacher task wide investig high dperform data mine network workstat dline estim match complex order logic integr framework learn numer term fol coevolutionari distribut search induc concept descript experiment evalu coevolut concept learn paper extens experiment evalu evolutionari approach concept learn present experiment perform system net investig effect approach dimens robust respect paramet set effect mdl criterion coupl stochast search bia impact coevolut qualiti solut comput effort requir abil face problem requir structur represent languag discuss obtain result suggest type approach provid introduct supervis concept learn tackl approach includ symbol connectionist evolut approach suit class problem depend instanc natur data avail domain specif knowledg hope make li learn classif program genet algorithm approach refin numer term horn claus paper extens experiment evalu evolutionari approach concept learn present experiment perform system net investig effect approach dimens robust respect paramet set effect mdl criterion coupl stochast search bia impact coevolut qualiti solut comput effort requir abil face problem requir structur represent languag discuss obtain result suggest type approach provid introduct supervis concept learn tackl approach includ symbol connectionist evolut approach suit class problem depend instanc natur data avail domain specif knowledg hope make li network genet algorithm concept learn paper present highli parallel genet algorithm design concept induct proposit order logic system exploit nich speci learn multimod concept deepli differ system distribut architectur total elimin concept common memori implement system design check possibl exploit parallel process network comput evalu standard benchmark experiment result show system reach good perform respect qualiti learn knowledg respect speed workstat cluster introduct recent literatur genet algorithm ga emerg valuabl search tool field concept induct de jong al janikow green amp smith giordana amp neri specif featur attract explor coevolutionari approach concept learn fonn combin order logic connectionist learn paper present neural network architectur manag structur data refin knowledg base express order logic languag present framework suit classif problem concept descript depend numer featur data fact main goal neural architectur refin numer part knowledg base chang structur discuss method translat set classif rule neural comput unit focu attent translat method algorithm refin network weight structur data classif theori refin manual handcraft automat acquir symbol relat learn system deal numer featur matter fact primari goal bring neural network architectur capabl deal structur data unrestrict size allowi coevolutionari approach concept learn refin order theori neural network integr multipl learn strategi order logic paper describ represent framework offer unifi platform altern system learn concept order logic main aspect framework discuss separ hypothesi logic languag version languag represent data mean relat databas motiv function layer data hypothes make data access logic level set abstract properti novelti hypothesi represent languag introduct construct intern disjunct construct aq induc system made oper set algorithm capabl learn discret continu valu attribut case algorithm embed learn system smart regal snap rtl paradigm symbol genet connectionist realizi fine dgrain parallel evolutionari program concept induct genet algorithm machin learn approach design learn system extract heurist exist adapt system genet algorithm heurist learn model base principl drawn natur evolut select breed featur distinguish genet algo rithm search method popul structur interpret candid solut problem competit select structur reproduct base structur fit solut problem ideal genet oper alter select structur order creat structur fur ther test learn control industri robot signific cost factor robot applic design develop real time robot control softwar control theori help linear control develop doesn suffici support gener linear control case complianc control nonlinear control essenti achiev high perform paper discuss machin learn appli design linear control altern function approxim includ multilay perceptron mlp radial basi function network rbfn fuzzi control analyz compar lead definit major famili open field function function approxim local recept field function approxim shown rbfn fuzzi control bear strong similar symbol interpret characterist appli symbol stati parallel genet algorithm concept learn map symbol knowledg local recept field network paper investig local recept field network broad class neural network includ probabilist neural network radial basi function network natur exhibit symbol properti specif attent class factoriz radial basi function network architectur directli translat proposit theori viceversa exploit characterist symbol numer algorithm eas integr autom network synthesi method includ classif regress tree statist cluster evalu classif task difficult medic domain obtain result show consid network class achiev high accuraci conserv symbol readabl introduct problem convert bodi symbol knowledg neural network viceversa investig author major contribut parallel genet algorithm concept learn search dintens concept induct paper describ regal distribut genet algorithm base system design learn order logic concept descript exampl system hybrid pittsburgh michigan approach popul constitut redund set partial concept descript evolv separ order increas effect regal specif tailor concept learn task regal task depend hand domain independ system prove robust respect paramet set varieti applic domain regal base select oper call univers suffrag oper provabl allow popul asymptot converg averag equilibrium state speci coexist system present serial parallel version distribut comput model propos discuss system test learn disjunct concept definit genet algorithm learn disjunct concept mean genet algorithm watanab know guess formal qualit studi wilei york ny weiss indurkhya weiss indurkhya small sampl decis tree prune intern machin learn confer brunswick nj wilson wilson classifi system animat problem machin learn wittgenstein wittgenstein ascomb editor philosoph investig oxford blackwel london uk wnek michalski wnek michalski hypothesi driven construct induct aq hci method experi machin learn bibliographi intern workshop machin learn page evanston il morgan kaufmann slotta chi slotta chi understandin formal model select genet algorithm watanab know guess formal qualit studi wilei york ny weiss indurkhya weiss indurkhya small sampl decis tree prune intern machin learn confer brunswick nj wilson wilson classifi system animat problem machin learn wittgenstein wittgenstein ascomb editor philosoph investig oxford blackwel london uk wnek michalski wnek michalski hypothesi driven construct induct aq hci method experi machin learn bibliographi intern workshop machin learn page evanston il morgan kaufmann slotta chi slotta chi understandin learn disjunct concept distribut genet algorithm paper regal giordana amp saitta encod order logic fol formula bit string fix length order make regal represent languag constrain finit defin languag templat repres maxim complex formula result languag fol formula built conjunct disjunct negat intern disjunct existenti univers quantif regal genet oper defin point uniform crossov de jong goldberg gener special crossov specif design task hand giordana amp sale seed oper primarili initi popul order start set formula cover concept giordana amp saitta basic genet algorithm improv version share function mechan goldberg amp richardson introduc order format subpopul concept multimod structur discuss section learn disjunct concept fundament novelti regal abil learn disjunct concept disjunct concept requir descript form formula cover region instanc space correspond mode concept fit function formula take account usual complet consist michalski exhibit maxima correspond mode concept presenc nois strict condit learn relat genet algorithm watanab know guess formal qualit studi wilei york ny weiss indurkhya weiss indurkhya small sampl decis tree prune intern machin learn confer brunswick nj wilson wilson classifi system animat problem machin learn wittgenstein wittgenstein ascomb editor philosoph investig oxford blackwel london uk wnek michalski wnek michalski hypothesi driven construct induct aq hci method experi machin learn bibliographi intern workshop machin learn page evanston il morgan kaufmann slotta chi slotta chi understandin smart multi dstrategi learn tool induc concept descript order logic inher complex task main reason hand task formul search problem insid larg space logic descript strong heurist manag size hand develop algorithm unabl handl numer featur typic occur realworld data paper describ learn system smart emb sophist knowledg base heurist control search process deal numer featur smart learn strategi induct deduct abduct exploit backgruond knowledg statist evalu criteria simpl genet algorithm refin predic semant aspect detail final evalu smart perform made complex task introduct recent literatur learn simpl recurs theori induct recurs theori normal ilp set difficult learn task complex equival multipl predic learn paper propos comput solut relev issu rais multipl predic learn problem separ andparallel conquer search strategi adopt interleav learn claus suppli predic mutual recurs definit gener order impos search space claus investig order cope recurs suitabl consist recoveri perform reformul current theori appli layer techniqu base collaps depend graph propos approach implement ilp system atr test laboratori size real world data set experiment result demonstr atr learn correct theori autonom discov concept depend final relat work main differ approach discuss learn relat evalu search strategi induc concept descript order logic inher complex task heurist need problem manag size paper explor effect altern search strategi includ inform gain priori knowledg qualiti acquir relat intend abil reconstruct rule gener exampl aim artifici domain creat experiment condit control solut learn problem perfect theori investig aspect impact complex descript languag instanc includ numer quantifi result show inform gain criterion greedi concept complex intern structur drawback share pure statist evalu criterion addit part comparison search strategi learn relat learn structur concept genet algorithm learn mutual depend relat extend invers resolut build abstract abstract background knowledg concept learn ion problem solv learn proceed intern join confer artif intellig page detroit mi morgan kaufmann vorberg goebel vorberg goebel da losen rekursiv programmierproblem rekursionsschemata kognitionswissenschaft yoo fisher yoo fisher concept format explan problem solv experi mylopoulo reiter editor proceed twelfth intern confer artifici intellig volum page san mateo ca morgan kaufmann michalski kodratoff michalski kodratoff research machin learn recent progress classif method futur direct kodratoff michalski editor machin learn artifici intellig approach volum chapter page morgan kaufmann san mateo ca minton al mint learn quantit featur symbol environ investig relationship abduct invers resolut proposit calculu abstract concept invers resolut integr learn real domain bias induct domain theori experiment evalu integr learn real domain deduct top ddown induct learn knowledg represent pattern analysi knowledg intens approach concept induct autom concept acquisit noisi environ integr ebl sbl approach knowledg base refin discrimin word larg vocabulari phonet descript model product system mean predic dtransit network expert system orient complex pattern recognit problem expert system map acoust cue phonet featur expert system speech decod 